\hypertarget{minpq_8h}{
\section{C:/Users/Matt/Documents/School/Robotics/zebulon/v2/vision/ext/SIFT/minpq.h File Reference}
\label{minpq_8h}\index{C:/Users/Matt/Documents/School/Robotics/zebulon/v2/vision/ext/SIFT/minpq.h@{C:/Users/Matt/Documents/School/Robotics/zebulon/v2/vision/ext/SIFT/minpq.h}}
}
{\ttfamily \#include $<$stdlib.h$>$}\par
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{structpq__node}{pq\_\-node}
\item 
struct \hyperlink{structmin__pq}{min\_\-pq}
\end{DoxyCompactItemize}
\subsection*{Defines}
\begin{DoxyCompactItemize}
\item 
\hypertarget{minpq_8h_aef8ee3f3e384a84c9bf0e9a8d48a3707}{
\#define {\bfseries MINPQ\_\-INIT\_\-NALLOCD}~512}
\label{minpq_8h_aef8ee3f3e384a84c9bf0e9a8d48a3707}

\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{structmin__pq}{min\_\-pq} $\ast$ \hyperlink{minpq_8h_a770736a93e27c2a71c3870e2f4f2a645}{minpq\_\-init} ()
\item 
int \hyperlink{minpq_8h_a4ba218f0faa633c9d6165ecf8c5aecf3}{minpq\_\-insert} (struct \hyperlink{structmin__pq}{min\_\-pq} $\ast$\hyperlink{structmin__pq}{min\_\-pq}, void $\ast$data, int key)
\item 
void $\ast$ \hyperlink{minpq_8h_aa10f3a304a2fc957595165dc9280f0b5}{minpq\_\-get\_\-min} (struct \hyperlink{structmin__pq}{min\_\-pq} $\ast$\hyperlink{structmin__pq}{min\_\-pq})
\item 
void $\ast$ \hyperlink{minpq_8h_a0e076362f81436900a34bf453245f554}{minpq\_\-extract\_\-min} (struct \hyperlink{structmin__pq}{min\_\-pq} $\ast$\hyperlink{structmin__pq}{min\_\-pq})
\item 
void \hyperlink{minpq_8h_a5f4a59a7249e8f007f9130af348fa340}{minpq\_\-release} (struct \hyperlink{structmin__pq}{min\_\-pq} $\ast$$\ast$\hyperlink{structmin__pq}{min\_\-pq})
\end{DoxyCompactItemize}


\subsection{Detailed Description}
Functions and structures for implementing a minimizing priority queue.

Copyright (C) 2006 Rob Hess $<$\href{mailto:hess@eecs.oregonstate.edu}{\tt hess@eecs.oregonstate.edu}$>$ \begin{DoxyVersion}{Version}
1.1.1-\/20070913 
\end{DoxyVersion}


\subsection{Function Documentation}
\hypertarget{minpq_8h_a0e076362f81436900a34bf453245f554}{
\index{minpq.h@{minpq.h}!minpq\_\-extract\_\-min@{minpq\_\-extract\_\-min}}
\index{minpq\_\-extract\_\-min@{minpq\_\-extract\_\-min}!minpq.h@{minpq.h}}
\subsubsection[{minpq\_\-extract\_\-min}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ minpq\_\-extract\_\-min (struct {\bf min\_\-pq} $\ast$ {\em min\_\-pq})}}
\label{minpq_8h_a0e076362f81436900a34bf453245f554}
Removes and returns the element of a minimizing priority queue with the smallest key.


\begin{DoxyParams}{Parameters}
\item[{\em \hyperlink{structmin__pq}{min\_\-pq}}]a minimizing priority queue\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Returns the element of {\itshape \hyperlink{structmin__pq}{min\_\-pq}\/} with the smallest key of NULL if {\itshape \hyperlink{structmin__pq}{min\_\-pq}\/} is empty 
\end{DoxyReturn}
\hypertarget{minpq_8h_aa10f3a304a2fc957595165dc9280f0b5}{
\index{minpq.h@{minpq.h}!minpq\_\-get\_\-min@{minpq\_\-get\_\-min}}
\index{minpq\_\-get\_\-min@{minpq\_\-get\_\-min}!minpq.h@{minpq.h}}
\subsubsection[{minpq\_\-get\_\-min}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ minpq\_\-get\_\-min (struct {\bf min\_\-pq} $\ast$ {\em min\_\-pq})}}
\label{minpq_8h_aa10f3a304a2fc957595165dc9280f0b5}
Returns the element of a minimizing priority queue with the smallest key without removing it from the queue.


\begin{DoxyParams}{Parameters}
\item[{\em \hyperlink{structmin__pq}{min\_\-pq}}]a minimizing priority queue\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Returns the element of {\itshape \hyperlink{structmin__pq}{min\_\-pq}\/} with the smallest key or NULL if {\itshape \hyperlink{structmin__pq}{min\_\-pq}\/} is empty 
\end{DoxyReturn}
\hypertarget{minpq_8h_a770736a93e27c2a71c3870e2f4f2a645}{
\index{minpq.h@{minpq.h}!minpq\_\-init@{minpq\_\-init}}
\index{minpq\_\-init@{minpq\_\-init}!minpq.h@{minpq.h}}
\subsubsection[{minpq\_\-init}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf min\_\-pq}$\ast$ minpq\_\-init ()\hspace{0.3cm}{\ttfamily  \mbox{[}read\mbox{]}}}}
\label{minpq_8h_a770736a93e27c2a71c3870e2f4f2a645}
Creates a new minimizing priority queue. \hypertarget{minpq_8h_a4ba218f0faa633c9d6165ecf8c5aecf3}{
\index{minpq.h@{minpq.h}!minpq\_\-insert@{minpq\_\-insert}}
\index{minpq\_\-insert@{minpq\_\-insert}!minpq.h@{minpq.h}}
\subsubsection[{minpq\_\-insert}]{\setlength{\rightskip}{0pt plus 5cm}int minpq\_\-insert (struct {\bf min\_\-pq} $\ast$ {\em min\_\-pq}, \/  void $\ast$ {\em data}, \/  int {\em key})}}
\label{minpq_8h_a4ba218f0faa633c9d6165ecf8c5aecf3}
Inserts an element into a minimizing priority queue.


\begin{DoxyParams}{Parameters}
\item[{\em \hyperlink{structmin__pq}{min\_\-pq}}]a minimizing priority queue \item[{\em data}]the data to be inserted \item[{\em key}]the key to be associated with {\itshape data\/} \end{DoxyParams}
\begin{DoxyReturn}{Returns}
Returns 0 on success or 1 on failure. 
\end{DoxyReturn}
\hypertarget{minpq_8h_a5f4a59a7249e8f007f9130af348fa340}{
\index{minpq.h@{minpq.h}!minpq\_\-release@{minpq\_\-release}}
\index{minpq\_\-release@{minpq\_\-release}!minpq.h@{minpq.h}}
\subsubsection[{minpq\_\-release}]{\setlength{\rightskip}{0pt plus 5cm}void minpq\_\-release (struct {\bf min\_\-pq} $\ast$$\ast$ {\em min\_\-pq})}}
\label{minpq_8h_a5f4a59a7249e8f007f9130af348fa340}
De-\/allocates the memory held by a minimizing priorioty queue


\begin{DoxyParams}{Parameters}
\item[{\em \hyperlink{structmin__pq}{min\_\-pq}}]pointer to a minimizing priority queue \end{DoxyParams}
